Primal–Dual Algorithms for Connected Facility Location Problems

Approximation Algorithms for Soft-Capacitated Connected Facility Location Problems

1 Abbreviations and Notations 2

Primal-Dual Algorithms for Connected Facility Location Problems

Distributed Approximation Algorithms for Facility Location Problems

In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facilit...

Approximation Algorithms for Facility Location Problems

This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005.

Approximation algorithms for facility location problems

We present new approximation algorithms for several facility location problems. In each facility location problem that we study, there is a set of locations at which we may build a facility (such as a warehouse), where the cost of building at location i is fi; furthermore, there is a set of client locations (such as stores) that require to be serviced by a facility, and if a client at location ...